On Continuous Local BDD-Based Search for Hybrid SAT Solving

We explore the potential of continuous local search (CLS) in SAT solving by proposing a novel approach for finding solution hybrid system Boolean constraints. The algorithm is based on CLS combined with belief propagation binary decision diagrams (BDDs). Our framework accepts all constraints that admit compact BDDs, including symmetric and small-coefficient pseudo-Boolean as interesting families. propose efficiently computing gradient needed CLS. study capabilities limitations our versatile solver, GradSAT, applying it many benchmark instances. experimental results indicate GradSAT can be useful addition to portfolio existing MaxSAT solvers satisfiability optimization problems.